Secure and Robust Identification via Classical-Quantum Channels

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Secure and Robust Identification via Classical-Quantum Channels

We study the identification capacity of classical-quantum channels (“cq-channels”), under channel uncertainty and privacy constraints. To be precise, we consider first compound memoryless cq-channels and determine their identification capacity; then we add an eavesdropper, considering compound memoryless wiretap cqq-channels, and determine their secret identification capacity. In the first case...

متن کامل

Quantum and classical message identification via quantum channels

We discuss concepts of message identification in the sense of Ahlswede and Dueck via general quantum channels, extending investigations for classical channels, initial work for classical–quantum (cq) channels and “quantum fingerprinting”. We show that the identification capacity of a discrete memoryless quantum channel for classical information can be larger than that for transmission; this is ...

متن کامل

Identification via Quantum Channels

We review the development of the quantum version of Ahlswede and Dueck’s theory of identification via channels. As is often the case in quantum probability, there is not just one but several quantizations: we know at least two different concepts of identification of classical information via quantum channels, and three different identification capacities for quantum information. In the present ...

متن کامل

Strong converse for identification via quantum channels

In this paper we present a simple proof of the strong converse for identification via discrete memoryless quantum channels, based on a novel covering lemma. The new method is a generalization to quantum communication channels of Ahlswede’s recently discovered appoach to classical channels. It involves a development of explicit large deviation estimates to the case of random variables taking val...

متن کامل

Secure Classical Bit Commitment over Finite Channels

If mistrustful parties A and B control two or more appropriately located sites, special relativity can be used to guarantee that a pair of messages exchanged by A and B are independent. Using this fact, an unconditionally secure relativistic bit commitment protocol, RBC1, was recently defined. Security is maintained in RBC1 by exchanging a sequence of messages whose transmission rate increases ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Information Theory

سال: 2019

ISSN: 0018-9448,1557-9654

DOI: 10.1109/tit.2019.2920952